Spatial Price Aggregation, Item Weight and Constant Utility
نویسندگان
چکیده
منابع مشابه
Rank Aggregation and Prediction with Item Features
We study the problem of rank aggregation with features, where both pairwise comparisons and item features are available to help the rank aggregation task. Observing that traditional rank aggregation methods disregard features, while models adapted from learning-to-rank task are sensitive to feature noise, we propose a general model to learn a total ranking by balancing between comparisons and f...
متن کاملOption price without expected utility
Article history: Received 26 April 2007 Received in revised form 8 February 2008 Accepted 6 March 2008 Available online xxxx OO We consider the meaning of the option price, commonly acknowledged as the preferred ex ante welfare measure, in the rank-dependent expected utility (RDEU) framework. The importance of this pertains to performing benefit-cost analysis when RDEU maximizers are prevalent ...
متن کاملConstant-Time Sliding Window Aggregation
Sliding-window aggregation is a widely-used approach for extracting insights from the most recent portion of a data stream. Most aggregation operations of interest can be cast as binary operators that are associative, but not necessarily commutative nor invertible. However, non-invertible operators are nontrivial to support efficiently. The best existing algorithms for this setting require Oplo...
متن کاملSpatial Aggregation : Theory and
Visual thinking plays an important role in scientiic reasoning. Based on the research in automating diverse reasoning tasks about dynamical systems, nonlinear controllers, kine-matic mechanisms, and uid motion, we have identiied a style of visual thinking, imagistic reasoning. Imagistic reasoning organizes computations around image-like, analogue representations so that perceptual and symbolic ...
متن کاملTernary Constant Weight Codes
Let A3(n, d,w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3(n, d,w) are presented, and a table of exact values and bounds in the range n ≤ 10 is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Review of Regional Studies
سال: 1988
ISSN: 1553-0892,0048-749X
DOI: 10.52324/001c.9324